Implementation of Signed and Unsigned Multiplier Using Efficient Modified Booth Encoder

This paper presents the design and implementation of signed-unsigned Modified Booth Encoding (SUMBE) multiplier. The present Modified Booth Encoding (MBE) multiplier and the Baugh-Wooley multiplier perform multiplication operation on signed numbers only. The array multiplier and Braun array multipliers perform multiplication operation on unsigned numbers only. Thus, the requisite of the modern computer system is a dedicated and very high speed unique multiplier unit for signed and unsigned numbers. Therefore, this paper presents the design and implementation of SUMBE multiplier. The modified Booth Encoder circuit engenders half the partial products in parallel. By elongating sign bit of the operands and engendering an adscititious partial product the SUMBE multiplier is obtained. The Carry preserve Adder (CSA) tree and the final Carry Look ahead (CLA) adder used to expedite the multiplier operation. Since signed and unsigned multiplication operation is performed by the same multiplier unit the required hardware and the chip area reduces and cost of a system.